Stationary algorithmic probability

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stationary algorithmic probability

Kolmogorov complexity and algorithmic probability quantify the randomness and universal a priori probability of finite binary strings. Nevertheless, they share the disadvantage of depending on the choice of the universal computer which is used as a reference computer to count the program lengths. In this paper, we propose an approach to algorithmic probability that tries to eliminate this machi...

متن کامل

Ex - Post Algorithmic Probability

Classical Probability theory is badly equipped to compute the probability of unique events, as it lacks the means to determine the relevant class to which the event belongs. Algorithmic Probability is designed to deal with individual events. It computes the chances that a given event will be output by a universal computing machine fed with random programs. This definition, however, fails to det...

متن کامل

Lecture 1: Algorithmic Probability

The Subject of this Series of Lectures is: Strong A.I. — what it is, how we may achieve it — apparent obstacles to achieving it — and how to overcome these obstacles. First: What is “strong A.I.”? My own personal interest is in a machine that is at least as good as a human in solving problems in Math, Science, and most aspects of Engineering. Eventually, through its ability to improve itself, a...

متن کامل

Algorithmic Probability—Theory and Applications

We first define Algorithmic Probability, an extremely powerful method of inductive inference. We discuss its completeness, incomputability, diversity and subjectivity and show that its incomputability in no way inhibits its use for practical prediction. Applications to Bernoulli sequence prediction and grammar discovery are described. We conclude with a note on its employment in a very strong A...

متن کامل

Diverse Consequences of Algorithmic Probability

We reminisce and discuss applications of algorithmic probability to a wide range of problems in artificial intelligence, philosophy and technological society. We propose that Solomonoff has effectively axiomatized the field of artificial intelligence, therefore establishing it as a rigorous scientific discipline. We also relate to our own work in incremental machine learning and philosophy of c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2010

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2009.09.017